Rational functions $H^{\infty}$ and $H^{p}$ on infinitely connected domains
نویسندگان
چکیده
منابع مشابه
Counterexamples to Rational Dilation on Symmetric Multiply Connected Domains
We show that if R is a compact domain in the complex plane with two or more holes and an anticonformal involution onto itself (or equivalently a hyperelliptic Schottky double), then there is an operator T which has R as a spectral set, but does not dilate to a normal operator with spectrum on the boundary of R. 0.1. Definitions. LetX be a compact, path connected subset ofC, with interior R, and...
متن کاملDistortion theorems for rational functions without poles or zeros in simply connected domains
We prove distortion theorems for rational functions without poles or zeros in simply connected domains. The distance between the values u(z1) and u(z2) assumed by such a rational function is limited by its degree and by the hyperbolic distance between z1 and z2. For discs and halfplanes, the case of equality in these estimates is fully explored. These results have applications in control theory...
متن کاملOn Divergence-based Distance Functions for Multiply-connected Domains
Given a finitely connected planar Jordan domain Ω, it is possible to define a divergence distance D(x, y) from x ∈ Ω to y ∈ Ω, which takes into account the complex geometry of the domain. This distance function is based on the concept of f -divergence, a distance measure traditionally used to measure the difference between two probability distributions. The relevant probability distributions in...
متن کاملOn Multiply Connected Wandering Domains of Meromorphic Functions
We describe conditions under which a multiply connected wandering domain of a transcendental meromorphic function with a finite number of poles must be a Baker wandering domain, and we discuss the possible eventual connectivity of Fatou components of transcendental meromorphic functions. We also show that if f is meromorphic, U is a bounded component of F (f) and V is the component of F (f) suc...
متن کاملSelf-testing Polynomial Functions Eeciently and over Rational Domains
In this paper we give the rst self-testers and checkers for polynomials over rational and integer domains. We also show signiicantly stronger bounds on the eeciency of a simple modiication of the algorithm for self-testing polynomials over nite elds given in 8].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 1968
ISSN: 0019-2082
DOI: 10.1215/ijm/1256054119